منابع مشابه
Real-Time Fault-Tolerant Atomic Broadcast
We present algorithms for Real-Time Fault-Tolerance Uniform Atomic Broadcast developed in the framework of the French project ATR (accord temps réel). We first design a distributed execution model for asynchronous systems with crash failure we called Synchronized Phase System (SPS), then we give an algorithm for Atomic Broadcast in SPS. In a SPS, the processes try to run in synchronized rounds ...
متن کاملParsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast
Atomic broadcast is a communication primitive that allows a group of n parties to deliver a common sequence of payload messages despite the failure of some parties. We address the problem of asynchronous atomic broadcast when up to t < n/3 parties may exhibit Byzantine behavior. We provide the first protocol with an amortized expected message complexity of O(n) per delivered payload. The most e...
متن کاملRealizability of Fault Tolerant Graphs∗
A connected graph G is optimal-κ if the connectivity κ(G) = δ(G), where δ(G) is the minimum degree of G. It is super-κ if every minimum vertex cut isolates a vertex. An optimal-κ graph G is moptimal-κ if for any vertex set S ⊆ V (G) with |S| ≤ m, G−S is still optimal-κ. The maximum integer of such m, denoted by Oκ(G), is the vertex fault tolerance of G with respect to the property of optimal-κ....
متن کاملFault-Tolerant Graphs for Tori
Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H , construct a graph G from H by adding a minimum number D( t , H ) of edges such that even after deleting any t edges from G the remaining graph contains H as a subgraph. We estimate D( t , H ) for the torus, which is well known ...
متن کاملFault-Tolerant Ring Embedding in Star Graphs
In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with fe n 3 faulty links a Hamiltonian cycle still can be found in an nstar, and that with fv n 3 faulty nodes a ring containing at most 4fv nodes less than that in a Hamiltonian cycle can be found (i.e., containing at leastn! 4fv nodes). In general, in an n-star with fe faulty links and fv faul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1985
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230150203